Untyped XQuery Canonization
نویسندگان
چکیده
XQuery is a powerful language defined by the W3C to query XML documents. Its query functionalities and its expressiveness satisfy the major needs of both the database community and the text and documents community. As an inconvenient, the grammar used to define XQuery is thus very complex and leads to several equivalent query expressions for one same query. This complexity often discourages XQuery-based software developers and designers and leads to incomplete XQuery handling. Works have been done in [DPX04] and especially in [Che04] to reduce equivalent forms of XQuery expressions into identified ”canonical forms”. However, these works do not cover the whole XQuery specification. We propose in this paper to extend these works in order to canonize the whole untyped XQuery specification.
منابع مشابه
An Advanced Technique for Rapid Data Processing in Cloud Computing Using X-query
XQuery was designed as a query language for XML data. The goal was to provide the expressive power of a query language like SQL and to support XML-specific operations such as navigation in hierarchical data. From the very beginning, an important feature of XQuery has been the capability to process untyped data. It can be concluded that XQuery tries to combine the features of existing programmin...
متن کاملTGV: A Tree Graph View for Modeling Untyped XQuery
XML [7] has become a de facto standard to exchange and represent any kind of data in various contexts. XML data can be manipulated using the XQuery [31] language, which can express though a compact and comprehensive way any queries and transformations. An XQuery expression is evaluated as follows. (1) the expression is rewritten into a "canonical XQuery", then (2) it is modeled in an internal r...
متن کاملExtension of a Semi Structured Algebra for XML to the Procedures Linked Operators
In this paper, we treat requests in XQuery in a system of mediation "everyXML".These requests use the operators of an algebra of semi-structured data which already exists and to which. we add a procedural aspect that treats the data of type document XML A mixed approach based on relational operators and models of data under shape of graphs, using timekeepers indexed in the process of reconstruc...
متن کاملOn Isomorphism and Canonization of Tournaments and Hypertournaments
We give a polynomial-time oracle algorithm for Tournament Canonization that accesses oracles for Tournament Isomorphism and Rigid-Tournament Canonization. Extending the Babai-Luks Tournament Canonization algorithm, we give an n n) algorithm for canonization and isomorphism testing of k-hypertournaments, where n is the number of vertices and k is the size of hyperedges.
متن کاملA Log-space Algorithm for Canonization of Planar Graphs
Planar graph canonization is known to be hard for L this directly follows from L-hardness of tree-canonization [Lin92]. We give a log-space algorithm for planar graph canonization. This gives completeness for log-space under AC many-one reductions and improves the previously known upper bound of AC [MR91]. A planar graph can be decomposed into biconnected components. We give a log-space procedu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007